منابع مشابه
Efficient Nonparametric Conformal Prediction Regions
We investigate and extend the conformal prediction method due to Vovk, Gammerman and Shafer (2005) to construct nonparametric prediction regions. These regions have guaranteed distribution free, finite sample coverage, without any assumptions on the distribution or the bandwidth. Explicit convergence rates of the loss function are established for such regions under standard regularity condition...
متن کاملMultivariate Spacings Based on Data Depth : I . Construction of Nonparametric Multivariate Tolerance Regions
This paper introduces and studies multivariate spacings. The spacings are developed using the order statistics derived from data depth. Specifically, the spacing between two consecutive order statistics is the region which bridges the two order statistics, in the sense that the region contains all the points whose depth values fall between the depth values of the two consecutive order statistic...
متن کاملNonparametric Regression, Confidence Regions and Regularization
In this paper we offer a unified approach to the problem of nonparametric regression on the unit interval. It is based on a universal, honest and non-asymptotic confidence region An which is defined by a set of linear inequalities involving the values of the functions at the design points. Interest will typically centre on certain simplest functions in An where simplicity can be defined in term...
متن کاملMining Tolerance Regions with Model Trees
Many problems encountered in practice involve the prediction of a continuous attribute associated with an example. This problem, known as regression, requires that samples of past experience with known continuous answers are examined and generalized in a regression model to be used in predicting future examples. Regression algorithms deeply investigated in statistics, machine learning and data ...
متن کاملGraphs with smallest forgotten index
The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number $gamma=1,2$, the first through<br /...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2001
ISSN: 0090-5364
DOI: 10.1214/aos/1013203456